A comparison of two algorithms for solving closed crack problems

نویسندگان

  • Jean-Claude De Bremaecker
  • Michael Ferris
چکیده

In a recent paper Elvin and Leung [1] demonstrated the advantages of a new fast boundary element algorithm for solving closed crack problems. This algorithm uses the Displacement Discontinuity Method (DDM) and subdivides the problem into two sub-problems, one for the outer boundaries of the structure and one for the crack. In common with most methods for crack problems, it uses interface-or joint-elements to prevent interpenetration, following the scheme described by Crouch [2] (pp. 208-212). As we shall see, the use of such elements introduces errors of unknown magnitude in the computation of the stress intensity factor, whether the numerical scheme is the DDM, as in the present case, or the finite element method as in [3]. These errors appear not to have been noticed or explained. Thanks to the courtesy of Dr. Elvin, we have been able to compare the results obtained by [1] for their second problem with those obtained with the PATH algorithm [4-6] applied to a complementary formulation of the problem [7]. We will show that this formulation combined with the PATH algorithm eliminates these errors, albeit at the expense of some increase in computer time. We wish to thank Dr. Elvin both for giving us the details of their model and for many fruitful discussions. In the problem here examined a shallow crack EF (see Fig. 1) is subjected to compressive loading from a succession of surface point loads applied between B and C. (Details of the model are given in Table 1.) One wishes to determine the value of the stress intensity factor at one or both crack tips, the parts of the crack which are open, those which are in contact and slipping, and those which are stuck. It is important to note that the effect of each load is considered independently of the effects of the others (Elvin, pers. comm., 1999), see also [3]. In order to make the comparison of the two algorithms as meaningful as possible, we used exactly the same model as [1] with the following exceptions:-in [1] the elastic constants of the joint elements are K S = K N = 2 × 10 17 and Young's modulus E = 10 11 ; there are no joint elements in our model and E = 1.0;-[1] uses quadratic displacement discontinuity elements (QDD) at the surface and constant displacement discontinuity elements (CDD) on the crack (Elvin, pers. com., 1999), while …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

PERFORMANCE COMPARISON OF CBO AND ECBO FOR LOCATION FINDING PROBLEMS

The p-median problem is one of the discrete optimization problem in location theory which aims to satisfy total demand with minimum cost. A high-level algorithmic approach can be specialized to solve optimization problem. In recent years, meta-heuristic methods have been applied to support the solution of Combinatorial Optimization Problems (COP). Collision Bodies Optimization algorithm (CBO) a...

متن کامل

Three Metaheuristic Algorithms for Solving the Multi-item Capacitated Lot-sizing Problem with Product Returns and Remanufacturing

This paper proposes a new mixed integer programming model for multi-item capacitated lot-sizing problem with setup times, safety stock and demand shortages in closed-loop supply chains. The returned products from customers can either be disposed or be remanufactured to be sold as new ones again. Due to the complexity of problem, three meta-heuristics algorithms named simulated annealing (SA) al...

متن کامل

A Novel Heuristic Optimization Methodology for Solving of Economic Dispatch Problems

This paper presents a biogeography-based optimization (BBO) algorithm to solve the economic loadDispatch (ELD) problem with generator constraints in thermal plants. The applied method can solvethe ELD problem with constraints like transmission losses, ramp rate limits, and prohibited operatingzones. Biogeography is the science of the geographical distribution of biological species. The modelsof...

متن کامل

Solving Fractional Programming Problems based on Swarm Intelligence

This paper presents a new approach to solve Fractional Programming Problems (FPPs) based on two different Swarm Intelligence (SI) algorithms. The two algorithms are: Particle Swarm Optimization, and Firefly Algorithm. The two algorithms are tested using several FPP benchmark examples and two selected industrial applications. The test aims to prove the capability of the SI algorithms to s...

متن کامل

A development in the finite volume method for the crack growth analysis without global remeshing

Crack growth analysis has remained one of the challenging problems in the fracture mechanics of structures. On the other hand, the fatigue crack growth is a common phenomenon in the components of structures like airplanes, navies and fluid storages where the fracture due to crack should be considered in the design of these structures. In this paper, the finite volume method (FVM) is extended fo...

متن کامل

A Closed-Form Solution for Two-Dimensional Diffusion Equation Using Crank-Nicolson Finite Difference Method

In this paper a finite difference method for solving 2-dimensional diffusion equation is presented. The method employs Crank-Nicolson scheme to improve finite difference formulation and its convergence and stability. The obtained solution will be a recursive formula in each step of which a system of linear equations should be solved. Given the specific form of obtained matrices, rather than sol...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007